On Context Bisimulation for Parameterized Higher-order Processes
نویسنده
چکیده
This paper studies context bisimulation for higher-order processes, in the presence of parameterization (viz. abstraction). We show that the extension of higher-order processes with process parameterization retains the characterization of context bisimulation by a much simpler form of bisimulation called normal bisimulation (viz. they are coincident), in which universal quantifiers are eliminated; whereas it is not the same with name parameterization. These results clarify further the bisimulation theory of higher-order processes, and also shed light on the essential distinction between the two kinds of parameterization.
منابع مشابه
Forschungsberichte Des Fachbereichs Informatik Modal Characterization of Weak Bisimulation for Higher{order Processes Modal Characterization of Weak Bisimulation for Higher{order Processes
Context bisimulation 13, 1] has become an important notion of behavioral equivalence for higher{order processes. Weak forms of context bisimulation are particularly interesting, because of their high level of abstraction. We present a modal logic for this setting and provide a characterization of a variant of weak context bisimulation on second{order processes. We show how the logic permits com...
متن کاملHigher-order Processes with Parameterization over Names and Processes
Parameterization extends higher-order processes with the capability of abstraction and application (like those in lambda-calculus). This extension is strict, i.e., higher-order processes equipped with parameterization is computationally more powerful. This paper studies higher-order processes with two kinds of parameterization: one on names and the other on processes themselves. We present two ...
متن کاملModal Characterization of Weak Bisimulation for Higher-order Processes (Extended Abstract)
Context bisimulation [12, 1] has become an important notion of behavioural equivalence for higher–order processes. Weak forms of context bisimulation are particularly interesting, because of their high level of abstraction. We present a modal logic for this setting and provide a characterization of a variant of weak context bisimulation on second–order processes. We show how the logic permits c...
متن کاملBisimulation for Higher-Order Process Calculi
A higher-order process calculus is a calculus for communicating systems which contains higher-order constructs like communication of terms. We analyse the notion of bisimulation in these calculi. We argue that both the standard deenition of bisimulation (i.e., the one for CCS and related calculi), as well as higher-order bisimulation AGR88, Bou89, Tho90] are in general unsatisfactory, because o...
متن کاملThe Kell Calculus: A Family of Higher-Order Distributed Process Calculi
This paper presents the Kell calculus, a family of distributed process calculi, parameterized by languages for input patterns, that is intended as a basis for studying component-based distributed programming. The Kell calculus is built around a π-calculus core, and follows five design principles which are essential for a foundational model of distributed and mobile programming: hierarchical loc...
متن کامل